perm filename CARTWR.LE2[LET,JMC] blob sn#341514 filedate 1978-03-13 generic text, type C, neo UTF8
COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	.REQUIRE "LET.PUB" SOURCE FILE
C00004 ENDMK
C⊗;
.REQUIRE "LET.PUB" SOURCE FILE
∂AIL Robert Cartwright↓Department of Computer Science↓Cornell University
↓Upson Hall↓Ithaca, N.Y. 14853∞

Dear Corky:

	Your extended abstract turned up on my desk, and I read and
understood it.  I like your complete recursive programs, but I think
think the minimization schema will still be useful.  I am eager to
see the details of how you did the complete recursive programs;
the example seems a bit kludgey.

	I enclose a sketch of the generalization and two forms of
the conjecture that conditional expressions and parallel or are
adequate ways of constructing continuous functions over flat domains
from strict functions.  I have tried to prove one or the other for
about half a day without success.

.reg